Convergecast with Unbounded Number of Channels

نویسندگان

  • Roman V. Plotnikov
  • Adil I. Erzin
  • Vyacheslav V. Zalyubovskiy
چکیده

We consider a problem of minimum length scheduling for the conflict-free aggregation convergecast in wireless networks in a case when each element of a network uses its own frequency channel. This problem is equivalent to the well-known NP-hard problem of telephone broadcasting since only the conflicts between the children of the same parent are taken into account. We propose a new integer programming formulation and compare it with the known one by running the CPLEX software package. Based on the results of a numerical experiment, we concluded that our formulation is more preferable in practice to solve the considered problem by CPLEX than the known one. We also propose a novel heuristic algorithm, which is based on a genetic algorithm and a local search metaheuristic. The simulation results demonstrate the high quality of the proposed algorithm compared to the best known approaches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Link Scheduling and Channel Hopping for Convergecast in WirelessHART Networks

Fast convergecast is a critical functionality for data collection in wireless networks deployed for industrial monitoring and control. We address the joint link scheduling and channel hopping problem for convergecast in networks operating according to the recent WirelessHART standard. We first demonstrate that the minimum time to complete convergecast in networks with multi-line/tree routing to...

متن کامل

Conflict-Free Data Aggregation in WSN with Unbounded Number of Channels

We consider a problem of minimum length scheduling for conflict-free aggregation convergecast in wireless networks in a case when each element of a network uses its own frequency channel. This problem is equivalent to the well-known NP-hard problem of telephone broadcasting, since only the conflicts between the children of the same parent are taken into account. We propose a new integer program...

متن کامل

Fast convergecast for low-duty-cycled multi-channel wireless sensor networks

Convergecast is a fundamental operation in many wireless sensor network (WSN) applications. To conserve energy, many previous WSN protocols discuss to periodically schedule active timings (or say slots) of transmission links in the network. When collecting data, the slots should be carefully assigned to conserve latency. Recently, the multichannel concept is utilized to facilitate slot assignme...

متن کامل

Multi-Channel Scheduling for Fast Convergecast in Wireless Sensor Networks

We explore the following fundamental question how fast can information be collected from a wireless sensor network? We consider a number of design parameters such as, power control, time and frequency scheduling, and routing. There are essentially two factors that hinder efficient data collection interference and the half-duplex single-transceiver radios. We show that while power control helps ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1707.05457  شماره 

صفحات  -

تاریخ انتشار 2017